Probabilistic Fault Detection in Finite-State Machines Based on State Occupancy Measurements1

نویسنده

  • Christoforos N. Hadjicostis
چکیده

This paper discusses a probabilistic methodology for detecting permanent or transient functional changes in the statetransition mechanism of a deterministic finite-state machine (FSM). The associated detector observes the frequencies with which states are occupied and detects faults by analyzing the deviation between the expected frequencies and the actual measurements. In addition to state occupancy measurements, the detector requires a statistical characterization of the input, but does not need to know the order with which states appear or the input sequence that is applied to the FSM. The discussion in the paper focuses on the case of a single fault and on the performance of the fault detector in terms of the probabilities of detection and false alarm, the number of states, and the length of the observation window.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel PUF-Based Error Detection Methods in Finite State Machines

We propose a number of techniques for securing finite state machines (FSMs) against fault injection attacks. The proposed security mechanisms are based on physically unclonable functions (PUFs), and they address different fault injection threats on various parts of the FSM. The first mechanism targets the protection of state-transitions in a specific class of FSMs. The second mechanism addresse...

متن کامل

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Timed Probabilistic Reasoning on UML Specialization for Fault Tolerant Component Based Architectures

Architecture-based reasoning about reliability and fault tolerance is gaining increasing importance as component-based software architectures become more widespread. Architectural description languages (ADLs) are used to specify high-level views of software design. ADLs usually involve a static, structural view of a system together with a dynamic, state-transition-style semantics, facilitating ...

متن کامل

Improving fault coverage and minimising the cost of fault identification when testing from finite state machines

Software needs to be adequately tested in order to increase the confidence that the system being developed is reliable. However, testing is a complicated and expensive process. Formal specification based models such as finite state machines have been widely used in system modelling and testing. In this PhD thesis, we primarily investigate fault detection and identification when testing from fin...

متن کامل

On implementation of online testable state machines

This paper presents a technique for designing self–checking finite state machines that uses a 2-hot code for state encoding. The registers and output logic in resulting state machines are testable online. A new method for designing the output logic is also proposed in this paper Key-Words: Fault Detection, State Machines, Online Testing, Transient Faults, Permanent Faults

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002